A new generalization of metric spaces: rectangular M-metric spaces
نویسندگان
چکیده
منابع مشابه
On metric spaces induced by fuzzy metric spaces
For a class of fuzzy metric spaces (in the sense of George and Veeramani) with an H-type t-norm, we present a method to construct a metric on a fuzzy metric space. The induced metric space shares many important properties with the given fuzzy metric space. Specifically, they generate the same topology, and have the same completeness. Our results can give the constructive proofs to some probl...
متن کاملM+-tree : A New Dynamical Multidimensional Index for Metric Spaces
In this paper, we propose a new metric index, called M-tree, which is a tree dynamically organized for large datasets in metric spaces. The proposed M-tree takes full advantages of M-tree and MVP-tree, with a new concept called key dimension, which effectively reduces response time for similarity search. The main idea behind the key dimension is to make the fanout of tree larger by partitioning...
متن کاملA generalization of Kannan and Chatterjea fixed point theorems on complete $b$-metric spaces
In this paper, we give some results on the common fixed point of self-mappings defined on complete $b$-metric spaces. Our results generalize Kannan and Chatterjea fixed point theorems on complete $b$-metric spaces. In particular, we show that two self-mappings satisfying a contraction type inequality have a unique common fixed point. We also give some examples to illustrate the given results.
متن کاملOn the topology of D-metric spaces and generation of D-metric spaces from metric spaces
An example of a D-metric space is given, in which D-metric convergence does not define a topology and in which a convergent sequence can have infinitely many limits. Certain methods for constructing D-metric spaces from a given metric space are developed and are used in constructing (1) an example of a D-metric space in which D-metric convergence defines a topology which is T1 but not Hausdorff...
متن کاملOn M-tree Variants in Metric and Non-metric Spaces
Although there have been many metric access methods (MAMs) developed so far to solve the problem of similarity searching, there is still big need for gapping retrieval efficiency. One of the most acceptable MAMs is M-tree which meets the essential features important for large, persistent and dynamic databases. M-tree’s retrieval inefficiency is hidden in overlaps of its regions, therefore, its ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Sciences
سال: 2018
ISSN: 2008-1359,2251-7456
DOI: 10.1007/s40096-018-0262-4